Description: 本书是关于计算机科学与工程领域的基础性研究科目之一——数据结构与算法的专著。
本书在简要回顾了基本的C++ 程序设计概念的基础上，全面系统地介绍了队列、堆栈、树、图等基本数据结构，以及贪婪算法、分而治之算法、分枝定界算法等多种算法设计方法，为数据结构与算法的继续学习和研究奠定了一个坚实的基础。更为可贵的是，本书不仅仅介绍了理论知识，还提供了50多个应用实例及600多道练习题。
本书内容广博权威，结构清晰合理，是一本全新的有关数据结构与算法的教材，对于计算机科学与工程领域的从业人员也是一本很好的参考书。-The book is about computer science and engineering fields of basic research one of the subjects- the data structure and algorithm monographs.
This book in a brief review of basic C++ program design based on the concept of comprehensive and systematic introduction to the queue, stack, tree, map and other basic data structures, as well as the greedy algorithm, divide and conquer algorithm, branch-and-bound algorithm algorithm design, etc. methods for data structure and algorithm to continue to study and research has laid a solid foundation. More valuable is, this book introduces not only theoretical knowledge, but also provided more than 50 applications and more than 600 exercises Road.
Broad authority of the contents of this book, the structure of a clear and reasonable, is a new data structure and algorithm-related teaching materials for computer science and engineering practitioners in the field is also a good reference book. Platform: |
Size: 17261568 |
Author:ichoo |
Hits:
Description: 问题描述：按照国际象棋的规则，车可以攻击与之处在同一行或同一列上的棋子。指南车是有方向的车。横向指南车可以攻击与之处在同一行上的棋子。纵向指南车可以攻击与之处在同一列上的棋子。指南车问题要求在m×n格的棋盘上放置指南车，并确定各指南车的攻击方向，使棋盘上不受指南车攻击的方格数最多。
编程任务：对于给定的m×n格的棋盘和2 个整数x 和y。整数x 表示棋盘上有x个规定方格应放置指南车，但攻击方向未定。整数y表示除了已规定放置位置的x个指南车外，还要在棋盘上放置y个指南车，其位置和攻击方向均未定。设计一个分支限界法，计算x+y 个指南车的放置方案，使棋盘上不受指南车攻击的方格数最多。
-Problem Description: In accordance with the rules of chess, can attack with vehicles in the same column or row on the chess pieces. Guide to car yes car have direction. Horizontal guide in the car can attack with a pawn on the same line. Vertical guide in the car can attack with a pawn on the same row. Guide to car questions asked in the m × n grid of the chessboard placed guide vehicles, and to determine the guidelines for car attack direction, so that from the chessboard grid attacks cart number.
Programming tasks: For a given m × n grid of the chessboard and the two integers x and y. Integer x has x express chessboard grid of the provisions of the Guide should be placed car, but the direction of undetermined attack. Integer y that has been apart from the provisions of the x position to place a guide to the vehicle, but also in the board to place a guide y car, its location and direction of the attack were not set. Design of a branch and bound method to calculate x+ y个guide plac Platform: |
Size: 1024 |
Author:yxd |
Hits:
Description: 使用R-tree和分支限界方法解决N维NN问题，带报告。带数据生成器和R-TREE模板。-The use of R-tree and branch and bound method to solve N-dimensional NN problem with the report. With the data generator and R-TREE template. Platform: |
Size: 700416 |
Author:mayjojo |
Hits:
Description: 用来解决旅行商问题 可以直接运行 很好的代码-Used to solve the traveling salesman problem can be directly run a very good code Platform: |
Size: 2048 |
Author:罗兰 |
Hits:
Description: 分支定界算法的GUI版
用来解整数规划问题
相当方便-Branch and bound algorithm for the solution of the GUI version of integer programming problem Convenience ~ ~ ~ Platform: |
Size: 1024 |
Author:guiji |
Hits:
Description: 讲述了模式识别中特征的提取和特征的转化，及对分支定界的鉴戒-Pattern recognition on the extraction of features and characteristics of the transformation, and the warning of the branch and bound Platform: |
Size: 18432 |
Author:陈西 |
Hits:
Description: 全书从算法设计和算法分析的基本概念和方法入手，系统介绍了算法设计方法与分析技巧。全书分为3个部分：第一部分介绍算法的基本概念、算法的数学基础以及算法复杂度分析；第二部分针对排序问题和图的问题，讨论各种已有的算法，并介绍常用的算法设计方法包括分治法、贪心法、动态规划法、回溯法和分支限界法，并介绍了计算的复杂性以及NP完全问题；第三部分讲述并行计算模型和并行算法设计技术。书中每章后面都附有一定数量的习题，帮助读者理解和掌握书中的内容。-Book from the algorithm design and algorithm analysis, starting with the basic concepts and methods, the system introduced the method of algorithm design and analysis skills. The topics are divided into three parts: the first part introduced the basic concepts of algorithms, mathematical algorithms and algorithms based on complexity analysis scheduling problem for the second part of the problem and plans to discuss a variety of existing algorithms, and describes the design of commonly used algorithms including sub-rule law, greedy method, dynamic programming, backtracking and branch and bound method, and describes the complexity of the calculation, as well as NP-complete problem the third part of the model on parallel computing and parallel algorithm design techniques. Each chapter is behind the book comes with a certain number of exercises to help readers understand and grasp the contents of the book. Platform: |
Size: 7182336 |
Author:shang |
Hits:
Description: 算法分析中，分支限界法的实现，并有完整的测试数据-Algorithm analysis, the achievement of branch and bound method, as well as complete test data Platform: |
Size: 25600 |
Author:fanhenglong |
Hits:
Description: 运用分支定界法求解混合整数线性规划，可用于求解电力系统机组组合问题- solving mixed integer linear programming branch and bound method ,and the program can solve unit commitment problem Platform: |
Size: 2048 |
Author:苏济归 |
Hits:
Description: 分支定界搜索算法。一种重要的搜索算法，对普通的搜索算法是很好的优化-Branch and bound search algorithm. An important search algorithm, search algorithm on the ordinary is a good optimization Platform: |
Size: 1145856 |
Author:cebk |
Hits:
Description: A classic Steiner tree constructor based on branch-and-bound with the most close-to-optimum solution quality Platform: |
Size: 530432 |
Author:Ernesto Liu |
Hits:
Description: filldisk is an utility to optimize filling a media (cd/dvd/others with big files while wasting the minimum amount of space on it.
It is an integer binary programming application using a customized branch and bound algorithm which focuses on yes/no contribution and an upper bound for the objective function. Platform: |
Size: 7168 |
Author:carlorossi |
Hits:
Description: 最优装载方案
成绩: 0 / 折扣: 0.8
试设计一个用队列式分支限界法搜索子集空间树的函数。该函数的参数包括结点可行性判定函数和上界函数等必要的函数，并将此函数用于解装载问题。
装载问题描述如下：有一批共n个集装箱要装上艘载重量为c的轮船，其中集装箱i的重量为wi 。找出一种最优装载方案，将轮船尽可能装满，即在装载体积不受限制的情况下，将尽可能重的集装箱装上轮船。
输入：第一行有2个正整数n和c。n是集装箱数，c是轮船的载重量
接下来的1行中有n个正整数，表示集装箱的重量
输出：最大载重量
例如：
输入：
5 10
7 2 6 5 4
输出：
10-Optimal loading program
Results: 0/discount: 0.8
Try to design a queue-type branch and bound by law search a subset of function space tree. The function of the parameters to determine the feasibility of including the node function and the upper bound of the necessary functions, such as function, this function will be loaded for the solution of the problem.
Loading problem described as follows: a group of n containers were loaded on ships to load ships for the c, of which the weight of the container i was wi. A program to find the optimal load, the ship filled with as much as possible, that is unrestricted in the loading volume of cases, as far as possible, re-fitted shipping container.
Input: the first line there are two positive integers n and c. n is the number of containers, c is the ship s deadweight
1 the next line in a positive integer n, that the weight of the container
Output: the maximum load
For example:
Input:
5 10
72,654
Output:
10 Platform: |
Size: 958464 |
Author:cj |
Hits:
Description: 算法分析中的皇后问题，采用分枝限界法进行求解-Algorithm analysis of Queen' s question, the use of Branch and Bound method for solving Platform: |
Size: 1024 |
Author: |
Hits:
Description: 采用分枝限界法进行求解最短路径长度的问题，是算法设计中的经典题目-Branch and Bound method used to solve the problem of the shortest path length, is the classic algorithm design topics Platform: |
Size: 1024 |
Author: |
Hits:
Search - branch and bound